A Highly Available Replication Control Protocol Using Volatile Witnesses
نویسنده
چکیده
We propose a highly available replication control protocol tailored to environments where network partitions are always the result of a gateway failure. Our protocol divides nodes holding replicas into local nodes that can communicate directly with each other and non-local nodes that communicate with other nodes through one or more gateways. While local nodes are assumed to remain up to date as long as they don’t crash, non-local nodes are required to maintain a volatile witness on the same network segment as the local nodes and must poll this witness before answering any user request. To speed up recovery from a total failure, each site maintains a list of replicas that were available the last time the data were updated or a replica recovered from a crash. Markov models are used to compare the performance of our protocol with that of the dynamic-linear voting protocol (DLV), which is the best replication control protocol tolerating communication failures. We also observe that volatile witness placement has a strong impact on data availability and gateway nodes are the best location for them.
منابع مشابه
Voting with Regenerable Volatile Witnesses
Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. We propose to replace some of these replicas by volatile witnesses that have no data and require no stable storage, and to regenerate them instead of waiting for recovery. The small size of volatile witnesses allows them to be regenerated much easi...
متن کاملSHAFT: Serializable, Highly Available and Fault Tolerant Concurrency Control in the Cloud
Guaranteeing transaction semantics in a highly available and fault tolerant manner is desirable to application developers. Besides, it is a very valuable feature for database-backed applications. SHAFT is a pessimistic concurrency control protocol for partitioned and replicated data, which can be distributed across multiple datacenters. Laying its basis on the Paxos algorithm, the SHAFT protoco...
متن کاملEvaluation of a BIBD Based Directional MAC Protocol for Wireless Ad Hoc Networks
The use of directional antennas in wireless ad hoc networks can significantly improve global performance due to a high spatial channel reuse. Nevertheless, its introduction poses new location dependent problems related to the MAC protocol. In this paper, the Balanced Incomplete Block Design theory has been exploited to develop a new MAC protocol for wireless ad hoc networks using directional ant...
متن کاملTrust Based Node Replication Attack Detection Protocol for Wireless Sensor Networks
The harmful attack against Wireless Sensor Networks (WSN) is Node Replication attack, where one or more node(s) illegitimately claims an identity, are also called clone attack due to identity theft. The Node replication attack can be exceedingly injurious to many important functions of the sensor network such as routing, resource allocation, misbehavior detection, This study proposes a method R...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994